OKP Supply Chain Scheduling
نویسندگان
چکیده
In one-of-a-kind production (OKP), a firm usually keeps zero stock for some components of which the demand is unstable. In this work, we model the scheduling problem for the OKP firm who promises due-date-guaranteed delivery to its customers. The firm schedules its jobs to minimize its total cost concerning the constraint of components delivery from its supplier. We develop a pair-wise scheduling algorithm to model. The simulation test shows that the proposed pair-wise scheduling algorithm can find the near optimal solution.
منابع مشابه
Study and Prospects: Adaptive Planning and Control of Supply Chain in One-of-a-kind Production
Based on the research project titled “AdaptivePlanningandControlofSupplyChaininOne-of-a-kind Production”, the research group performed a systematicreview ofsupply chain integration, riskprediction and control and traceability. Studies of a computer-aided and integrated production system for cost-effective OKP systemare included. Our efforts relevant to integration of supply chain in OKP, modeli...
متن کاملA Genetic Algorithm Developed for a Supply Chain Scheduling Problem
This paper concentrates on the minimization of total tardiness and earliness of orders in an integrated production and transportation scheduling problem in a two-stage supply chain. Moreover, several constraints are also considered, including time windows due dates, and suppliers and vehicles availability times. After presenting the mathematical model of the problem, a developed version of GA c...
متن کاملSupply Chain Scheduling Using a Transportation System Composed of Vehicle Routing Problem and Cross-Docking Approaches
This study considers a combination of cross-docking and vehicle routing problem (VRP) approachesto transport raw material and parts in a supply chain. The supply chain is composed of some supplierswhich are spread in different geographical zones and multiple shared vehicles with different speedsand capacities for transporting orders from the suppliers to a manufacturer. After ...
متن کاملA branch and bound algorithm to minimize the total weighted number of tardy jobs and delivery costs with late deliveries for a supply chain scheduling problem
In this paper, we study a supply chain scheduling problem that simultaneously considers production scheduling and product delivery. jobs have to be scheduled on a single machine and delivered to customers for further processing in batches. The objective is to minimize the sum of the total weighted number of tardy jobs and the delivery costs. In this paper, we present a heuristic algorithm (HA...
متن کاملIntegrated Process Planning and Active Scheduling in a Supply Chain-A Learnable Architecture Approach
Through the lens of supply chain management, integrating process planning decisions and scheduling plans becomes an issue of great challenge and importance. Dealing with the problem paves the way to devising operation schedules with minimum makespan; considering the flexible process sequences, it can be viewed as a fundamental tool for achieving the scheme, too. To deal with this integration, t...
متن کامل